A Scheduling Algorithm for Parallelizable Dependent Tasks
نویسندگان
چکیده
Scheduling a collection of tasks on a multiprocessor, consisting of p processors, that minimizes the maximum completion time has attracted a lot of attention in the literature [12]. In this paper, we introduce a new problem of scheduling a task graph on a multiprocessor, called the parallelizable dependent task scheduling problem. Associated with each task, we are given the time it takes to run on a uniprocessor, and the speedup that can be obtained by running it on i processors, 1≤i ≤p . We present an algorithm for the problem and analyze the performance.
منابع مشابه
Scheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms
This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...
متن کاملPerformance and Reliability-Driven Scheduling Approach for Efficient Execution of Parallelizable Stochastic Tasks in Heterogeneous Computing Systems
In heterogeneous computing systems, a suite of different machines is interconnected to provide a variety of computational capabilities to execute collections of real-time application tasks that have diverse requirements. In these systems, machine failures are inevitable and can have an adverse effect on applications executing on the system. To reduce this effect, an efficient scheduling approac...
متن کاملPareto-based Multi-criteria Evolutionary Algorithm for Parallel Machines Scheduling Problem with Sequence-dependent Setup Times
This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...
متن کاملChannel Based Scheduling of Parallelizable Tasks
In this paper we consider the problem of scheduling a set of tasks on a parallel machine of identical processors. The tasks are parallelizable and can be run simultaneously on several processors, in which case the runtime is decreased. Our goal is to minimize the finish time (or Makespan) of the entire schedule. This problem is known to be NP-Hard. We propose a new approach to scheduling, based...
متن کاملDiversified Particle Swarm Optimization for Hybrid Flowshop Scheduling
The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequence-dependent setup times problem, which is of great importance in the industrial context. This algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991